Communication Complexity Protocols for Q-trits
نویسنده
چکیده
Consider a function where its entries are distributed among many parties. Suppose each party is allowed to transmit only a limited amount of information to a net. One can use a classical protocol to guess the value of the global function. Is there a quantum protocol improving the results of all classical protocols? In [3] Brukner et al. showed the deep connection between such problems and the theory of Bell’s inequalities. Here we generalize the theory to trits. There, the best classical protocol fails whereas the quantum protocol yields the correct answer.
منابع مشابه
On the Power of Multiplexing in Number-on-the-Forehead Protocols
We study the direct-sum problem for k-party “Number On the Forehead” (NOF) deterministic communication complexity. We prove several positive results, showing that the complexity of computing a function f in this model, on l instances, may be significantly cheaper than l times the complexity of computing f on a single instance. Quite surprisingly, we show that this is the case for “most” (boolea...
متن کاملOptimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
We show optimal Direct Sum result for the one-way entanglement-assisted quantum communication complexity for any relation f ⊆ X × Y × Z. We show: Q(f) = Ω(m · Q(f)), where Q(f), represents the one-way entanglement-assisted quantum communication complexity of f with error at most 1/3 and f⊕m represents m-copies of f . Similarly for the one-way public-coin classical communication complexity we sh...
متن کاملEfficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption
We propose a set of primitives based on El Gamal encryption that can be used to construct efficient multiparty computation protocols for certain low-complexity functions. In particular, we show how to privately count the number of true Boolean disjunctions of literals and pairwise exclusive disjunctions of literals. Applications include efficient two-party protocols for computing the Hamming di...
متن کاملSimultaneous Communication Protocols with Quantum and Classical Messages
We study the simultaneous message passing (SMP) model of communication complexity, for the case where one party is quantum and the other is classical. We show that in an SMP protocol that computes some function with the first party sending q qubits and the second sending c classical bits, the quantum message can be replaced by a randomized message of O(qc) classical bits, as well as by a determ...
متن کاملUnbounded-Error Quantum Query Complexity
This work studies the quantum query complexity of Boolean functions in a scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication complexity model, the unbounded error quantum query complexity is exactly half of its classical counterpart for any (partial or total) Boolean function. Moreover, we ...
متن کامل